A Totally Unimodular Description of the Consistent Value Polytope
نویسندگان
چکیده
We present a theoretical study on the idea of using mathematical programming relaxations for filtering binary constraint satisfaction problems. We introduce the consistent value polytope and give a linear programming description that is provably tighter than a recently studied formulation. We then provide an experimental study that shows that, despite the theoretical progress, in practice filtering based on mathematical programming relaxations continues to perform worse than standard arc-consistency algorithms for binary constraint satisfaction problems.
منابع مشابه
A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming
We present a theoretical study on the idea of using mathematical programming relaxations for filtering binary constraint satisfaction problems. We introduce the consistent value polytope and give a linear programming description that is provably tighter than a recently studied formulation. We then provide an experimental study that shows that, despite the theoretical progress, in practice filte...
متن کاملIsolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces
We deterministically construct quasi-polynomial weights in quasi-polynomial time, such that in a given polytope with totally unimodular constraints, one vertex is isolated, i.e., there is a unique minimum weight vertex. More precisely, the property that we need is that every face of the polytope lies in an affine space defined by a totally unimodular matrix. This derandomizes the famous Isolati...
متن کاملFast Unimodular Counting
This paper describes methods for counting the number of non-negative integer solutions of the system Ax = b when A is a non-negative totally unimodular matrix and b an integral vector of fixed dimension. The complexity (under a unit cost arithmetic model) is strong in the sense that it depends only on the dimensions of A and not on the size of the entries of b. For the special case of “continge...
متن کاملFibonacci Polytopes and Their Applications
A Fibonacci d-polytope of order k is defined as the convex hull of {0, 1}-vectors with d entries and no consecutive k ones, where k ≤ d. We show that these vertices can be partitioned into k subsets such that the convex hull of the subsets give the equivalent of Fibonacci (d− i)polytopes, for i = 1, . . . , k, which yields a “Fibonacci like” recursive formula to enumerate the vertices. Surprisi...
متن کاملA bidirected generalisation of network matrices
We provide a new class of matrices, called binet matrices (denoted by B), which guarantee half-integral vertices for the polytope P = fx : l x u; a Bx bg. They furnish a direct generalisation of totally unimodular network matrices and arise from the node-edge incidence matrices of bidirected graphs in the same way as the network matrices do from directed graphs. We develop the necessary theory ...
متن کامل